Communication complexity of two decision problems
نویسندگان
چکیده
منابع مشابه
Some Decision Problems of Enormous Complexity
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic logical notions. Their complexities range from iterated exponential time completeness to ∈0 time completeness to θ(Ω,0) time completeness to θ(Ωω,,0) time completeness. These three ordinals are well known ordinals from p...
متن کاملOn Communication Complexity of Classification Problems
This work introduces a model of distributed learning in the spirit of Yao’s communication complexity model. We consider a two-party setting, where each of the players gets a list of labelled examples and they communicate in order to jointly perform some learning task. To naturally fit into the framework of learning theory, we allow the players to send each other labelled examples, where each ex...
متن کاملThe Communication Complexity of Efficient Allocation Problems
We analyze the communication burden of surplus-maximizing allocations. We study both the continuous and discrete models of communication, measuring its burden with the dimensionality of the message space and the number of transmitted bits, respectively. In both cases, we offer a lower bound on the amount of communication. This bound is applied to the problem of allocating L heterogeneous object...
متن کاملOrdered Biclique Partitions and Communication Complexity Problems
An ordered biclique partition of the complete graph Kn on n vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of Kn is covered by at least one and at most two bicliques in the collection, and (ii) if an edge e is covered by two bicliques then each endpoint of e is in the first class in one of these bicliques and in the second class in other one. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90167-9